All-or-Nothing Ordering Under a Capacity Constraint

All-or-Nothing Ordering Under a Capacity Constraint

We consider a supplier who faces stationary demand and uses dynamically updated forecast information to place orders to an upstream distributor. The order size is restricted and each order entails a high fixed cost. We characterize the form of the optimal policy in the special case where the fixed cost of ordering is high enough to warrant all-or-nothing ordering in each period.

All or Nothing at All

We continue a study of unconditionally secure all-or-nothing transforms (AONT) begun in [12]. An AONT is a bijective mapping that constructs s outputs from s inputs. We consider the security of t inputs, when s − t outputs are known. Previous work concerned the case t = 1; here we consider the problem for general t, focussing on the case t = 2. We investigate constructions of binary matrices fo...

All-or-Nothing Monitoring

A principal can observe both the output and input of an agent who works at a job involving multiple tasks. We provide a simple theory that explains why it may be optimal for the principal to use only output-based incentive contract, even though the principal can monitor the agent’s actions perfectly in all but one task and knows exactly which action is optimal for each task. (JEL: D82, M5, J33)

Take-all or nothing

Take-all disease of Poaceae is caused by Gaeumannomyces graminis (Magnaporthaceae). Four varieties are recognised in G. graminis based on ascospore size, hyphopodial morphology and host preference. The aim of the present study was to clarify boundaries among species and varieties in Gaeumannomyces by combining morphology and multi-locus phylogenetic analyses based on partial gene sequences of I...

Overwriting : All or Nothing ?